How does distributivity induce emphasis?
نویسنده
چکیده
1The particle ina follows gradable expressions and adds meanings such as ‘high in quantity/quality’ or ‘high in degree’ to the expression. Also, these meanings entail a degree of surprise, that is, quantity/quality/degree/extent is above expectation of the speaker. measure phrase such that the speaker entails that the height of Philip is way above the standard of comparison, i.e., Philip is very tall.
منابع مشابه
How does distributivity induce emphasis? Category: formal semantics
(3) a. ∃y. ∣y∣=2 ∧ *man(y) ∧ ∀z. z ∈ y ∧ AT(z) → ∃e. ∃x. ∣x∣=3 ∧ *bag(x) ∧ *carry(e) ∧ *Thm(e)=x ∧ *Ag(e)=z There is a pair of men y, and every atomic member of y carried three (possibly different) bags. b. ∃e. ∀e’. e’ ∈ e ∧ AT(e) → ∃y. ∣y∣=2 ∧ *man(y) ∧ ∃x. ∣x∣=3 ∧ *bag(x) ∧ *carry(e’) ∧ *Thm(e’)=x ∧ *Ag(e’)=y There is an event e, and every atomic subevent e’ of e is an event of two men (colle...
متن کاملA NEW NOTION OF FUZZY PS-COMPACTNESS
In this paper, using pre-semi-open L-sets and their inequality, a new notion of PS-compactness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This notion does not depend on the structure of the basis lattice L and L does not need any distributivity.
متن کاملPolymorphic Subtyping Without Distributivity
The subtyping relation in the polymorphic second-order-calculus was introduced by John C. Mitchell in 1988. It is known that this relation is undecidable, but all known proofs of this fact strongly depend on the distributivity axiom. Nevertheless it has been conjectured that this axiom does not innuence the undecidability. The present paper shows undecidability of subtyping when we remove distr...
متن کاملEquivalences, Identities, Symmetric Differences, and Congruences in Orthomodular Lattices
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity of equivalence terms and several other 3 variable expressions involving equivalence terms have been proved to hold in any orthomodular lattice. Symmetric di...
متن کاملFirst Steps in Relational Lattice
Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results include Spight distributivity criteria and its applications to query transformations.
متن کامل